Designing Practical Polar Codes Using Simulation-Based Bit Selection
نویسندگان
چکیده
منابع مشابه
Designing LDPC codes using bit-filling
Bipartite graphs of bit nodes and parity check nodes arise as Tanner graphs corresponding to low density parity check codes. Given graph parameters such as the number of check nodes, the maximum check-degree, the bit-degree, and the girth, we consider the problem of constructing bipartite graphs with the largest number of bit nodes, that is, the highest rate. We propose a simple-to-implement he...
متن کاملConstructing Polar Codes Using Iterative Bit-Channel Upgrading
The definition of polar codes given by Arikan is explicit, but the construction complexity is an issue. This is due to the exponential growth in the size of the output alphabet of the bit-channels as the codeword length increases. Tal and Vardy recently presented a method for constructing polar codes which controls this growth. They approximated each bit-channel with a “better” channel and a “w...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملOptimum Drill Bit Selection by Using Bit Images and Mathematical Investigation
This study is designed to consider the two important yet often neglected factors, which are factory recommendation and bit features, in optimum bit selection. Image processing techniques have been used to consider the bit features. A mathematical equation, which is derived from a neural network model, is used for drill bit selection to obtain the bit’s maximum penetration rate that corresponds ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Emerging and Selected Topics in Circuits and Systems
سال: 2017
ISSN: 2156-3357,2156-3365
DOI: 10.1109/jetcas.2017.2759253